Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
نویسندگان
چکیده
منابع مشابه
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the...
متن کاملA Decomposition Approach with Inserted Idle Time Scheduling Subproblems in Group Scheduling
This paper focuses on minimizing the makespan of a multi-machine flowshop group-scheduling problem that is typically found in the assembly of printed circuit boards, which is characterized as one with carryover sequencedependent setup times. The intent is to minimize the makespan of schedules comprised of the sequence of board groups as well as the sequence of board types within each group. Spe...
متن کاملSingle Machine Inserted Idle Time Scheduling with Release Times and Due Dates
The single machine scheduling problem is considered in which each task has a release dates, a processing time and a due date. The objective is to mimimize the maximum lateness. Preemption is not allowed. Scheduling problem 1|rj |Lmax is a NP-hard problem. We define an IIT (inserted idle time) schedule as a feasible schedule in which a processor is kept idle at a time when it could begin process...
متن کاملEnhancing Real-time Scheduling of Divisible Loads by Utilizing Inserted Idle Time
Providing QoS and performance guarantees for arbitrarily divisible loads in a cluster has become a significant problem. While progress is being made in scheduling arbitrarily divisible loads, some of the proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. Two contributions are made in addressing this problem. First, we propose two constraints tha...
متن کاملLocal and global dominance conditions for the weighted earliness scheduling problem with no idle time
In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2000
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.48.1.99.12447